Dynamic Point Cloud Denoising via Manifold-to-Manifold Distance

نویسندگان

چکیده

3D dynamic point clouds provide a natural discrete representation of real-world objects or scenes in motion, with wide range applications immersive telepresence, autonomous driving, surveillance, \etc. Nevertheless, are often perturbed by noise due to hardware, software other causes. While plethora methods have been proposed for static cloud denoising, few efforts made the denoising clouds, which is quite challenging irregular sampling patterns both spatially and temporally. In this paper, we represent naturally on spatial-temporal graphs, exploit temporal consistency respect underlying surface (manifold). particular, define manifold-to-manifold distance its counterpart graphs measure variation-based intrinsic between patches domain, provided that graph operators counterparts functionals Riemannian manifolds. Then, construct connectivity corresponding based points adjacent spatial domain. Leveraging initial representation, formulate as joint optimization desired regularized smoothness consistency. We reformulate present an efficient algorithm. Experimental results show method significantly outperforms independent each frame from state-of-the-art approaches, Gaussian simulated LiDAR noise.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Denoising Manifold and Non-Manifold Point Clouds

The faithful reconstruction of 3-D models from irregular and noisy point samples is a task central to many applications of computer vision and graphics. We present an approach to denoising that naturally handles intersections of manifolds, thus preserving high-frequency details without oversmoothing. This is accomplished through the use of a modified locally weighted regression algorithm that m...

متن کامل

Manifold Denoising

We consider the problem of denoising a noisily sampled submanifold M in R, where the submanifold M is a priori unknown and we are only given a noisy point sample. The presented denoising algorithm is based on a graph-based diffusion process of the point sample. We analyze this diffusion process using recent results about the convergence of graph Laplacians. In the experiments we show that our m...

متن کامل

3D Point Cloud Denoising using Graph Laplacian Regularization of a Low Dimensional Manifold Model

3D point cloud—a new signal representation of volumetric objects—is a discrete collection of triples marking exterior object surface locations in 3D space. Conventional imperfect acquisition processes of 3D point cloud—e.g., stereo-matching from multiple viewpoint images or depth data acquired directly from active light sensors—imply non-negligible noise in the data. In this paper, we adopt a p...

متن کامل

GROUPOID ASSOCIATED TO A SMOOTH MANIFOLD

‎In this paper‎, ‎we introduce the structure of a groupoid associated to a vector field‎ ‎on a smooth manifold‎. ‎We show that in the case of the $1$-dimensional manifolds‎, ‎our‎ ‎groupoid has a‎ ‎smooth structure such that makes it into a Lie groupoid‎. ‎Using this approach‎, ‎we associated to‎ ‎every vector field an equivalence‎ ‎relation on the Lie algebra of all vector fields on the smooth...

متن کامل

Graph-Based Manifold Frequency Analysis for Denoising

We propose a new framework for manifold denoising based on processing in the graph Fourier frequency domain, derived from the spectral decomposition of the discrete graph Laplacian. Our approach uses the Spectral Graph Wavelet transform in order to perform non-iterative denoising directly in the graph frequency domain, an approach inspired by conventional wavelet-based signal denoising methods....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE transactions on image processing

سال: 2021

ISSN: ['1057-7149', '1941-0042']

DOI: https://doi.org/10.1109/tip.2021.3092826